The Lossless Adaptive Binomial Data Compression Method

In this paper, we propose a new method for the binomial adaptive compression of binary sequences finite length without loss information. The advantage proposed compared with previously developed by authors is an increase in rate. This speed accompanied appearance quality—noise immunity compression. novelty method, which makes it possible to achieve these positive results, manifested adaptation ratio compressible required time, carried out dividing initial set into and incompressible sequences. based on theorem proved decomposition stationary Bernoulli source information combinatorial probabilistic source. last them number units. It acquires entropy close zero practically does not affect at considerable lengths Therefore, generating equiprobable paramount since require statistical data implemented numerical coding methods. As one methods, choose technique that uses numbers system. corresponding procedure consists three steps. first transformation sequence equilibrium combination, second its number, third number. restoration compressed occurs reverse order. terms degree universalization, similar methods convenient hardware implementation using noise-immune circuits. also enables potential opportunity build effective systems protecting from unauthorized access.